Understanding Promise Theory Using Rewriting Logic
نویسندگان
چکیده
We describe our effort to evaluate the syntax and constraints of Promise Theory using a tool developed in theMaude framework. Through the development of a Maude module we are able to do searches and queries in all possible syntactically valid Promise expressions of an arbitrary initial state of participants and constraints. We use this approach to improve the set of grammatical rules that is already available.
منابع مشابه
Experimentation with a Minimalist Prover for Discharging Verification Conditions of Correctness
Specialized decision procedures have shown much promise for discharging verification conditions (VCs) that arise from establishing correctness of programs. This paper explores the merits of an alternative approach for proving VCs using a general, yet minimalist rewriting prover. The advantages of the prover are that it is independent of the combination of theories involved in the VCs. So if a n...
متن کاملProving Modal Properties of Rewrite Theories Using Maude's Metalevel
Rewriting logic is a very expressive formalism for the specification of concurrent and distributed systems; more generally, it is a logic of change. In contrast, VLRL is a modal logic built on top of rewriting logic to reason precisely about that change. Here we present a technique to mechanically prove VLRL properties of rewrite theories using the reflective capability of rewriting logic throu...
متن کاملRepresenting the MSR Cryptoprotocol Specification Language in an Extension of Rewriting Logic with Dependent Types
This paper presents a shallow and efficient embedding of the security protocol specification language MSR into an extension of rewriting logic with dependent types. The latter is an instance of the open calculus of constructions which integrates key concepts from equational logic, rewriting logic, and type theory. MSR is based on a form of first-order multiset rewriting extended with existentia...
متن کاملMapping tile logic into rewriting logic
extends to concurrent systems with state changes the body of theory developed within the algebraic semantics approach. It is both a foundational tool and the kernel language of several implementation e orts (Cafe, ELAN, Maude). extends (unconditional) rewriting logic since it takes into account state changes with side e ects and synchronization. It is especially useful for de ning compositional...
متن کاملA rewriting logic approach to operational semantics
We show how one can use rewriting logic to faithfully capture (not implement) various operational semantic frameworks as rewrite logic theories, namely big-step and small-step semantics, reduction semantics using evaluation contexts, and continuation-based semantics. There is a one-to-one correspondence between an original operational semantics and its associated rewrite logic theory, both nota...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007